Randomly coloring graphs of logarithmically bounded pathwidth
نویسنده
چکیده
We consider the problem of sampling a proper k-coloring of a graph of maximal degree ∆ uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of logarithmically bounded pathwidth if k ≥ (1+ )∆, for any > 0, using a new hybrid paths argument. ∗California Institute of Technology, Pasadena, CA, 91125, USA. E-mail: [email protected].
منابع مشابه
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromatic Number are fixed parameter tractable, parameterised by treewidth, whereas List Hamilton Path is W[1]-hard, even parameterised by pathwidth. These results resolve two open questions of Fellows, Fomin, L...
متن کاملThe List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete ...
متن کاملOnline Problems, Pathwidth, and Persistence
We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bounded width, good online algorithms may exist for a number of natural problems. In the work presented we concentrate on online graph coloring problems, where we restrict the allowed input to instances having some form of bounded ...
متن کاملApproximating Treewidth and Pathwidth of some Classes of Perfect Graphs
In this paper we discuss the problem of finding approximations for the treewidth and pathwidth of cotriangulated graphs, convex graphs, permutation graphs and of cocomparability graphs. For a cotriangulated graph, of which the treewidth is at most k, the pathwidth is at most 3k + 4 and we show there exists an O( n2 ) algorithm finding a path-decomposition with width at most 3k + 4. For convex g...
متن کاملBounds and Fixed-Parameter Algorithms for Weighted Improper Coloring
We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper coloring in terms of the sum of edge w...
متن کامل